def fib(n):
    if n==0 or n==1:
        return 1
    return fib(n-1)+fib(n-2)
def PrintFN(m,n):
    list = []
    i=0
    while True:
        con = fib(i)
        i += 1
        if con<m:
            continue
        elif con>n:
            break
        else:
            list.append(con)
    return list

m,n,i=input().split()
n=int(n)
m=int(m)
i=int(i)
b=fib(i)
print("fib({0}) = {1}".format(i,b))
fiblist=PrintFN(m,n)
print(len(fiblist))